Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

Statistical Optimization of Flavonoid and Antioxidant Recovery from Macerated Chinese and Malaysian Lotus Root (Nelumbo nucifera) Using Response Surface Methodology

In this study, the combination of parameters required for optimal extraction of anti-oxidative components from the Chinese lotus (CLR) and Malaysian lotus (MLR) roots were carefully investigated. Box–Behnken design was employed to optimize the pH (X₁: 2–3), extraction time (X₂: 0.5–1.5 h) and solvent-to-sample ratio (X₃: 20–40 mL/g) to obtain a high flavonoid yield with high % DPPH_sc free radical scavenging and Ferric-reducing power assay (FRAP). The analysis of variance clearly showed the significant contribution of quadratic model for all responses. The optimal conditions for both Chinese lotus (CLR) and Malaysian lotus (MLR) roots were obtained as: CLR: X₁ = 2.5; X₂ = 0.5 h; X₃ = 40 mL/g; MLR: X₁ = 2.4; X₂ = 0.5 h; X₃ = 40 mL/g. These optimum conditions gave (a) Total flavonoid content (TFC) of 0.599 mg PCE/g sample and 0.549 mg PCE/g sample, respectively; (b) % DPPH_sc of 48.36% and 29.11%, respectively; (c) FRAP value of 2.07 mM FeSO₄ and 1.89 mM FeSO₄, respectively. A close agreement between predicted and experimental values was found. The result obtained succinctly revealed that the Chinese lotus exhibited higher antioxidant and total flavonoid content when compared with the Malaysia lotus root at optimum extraction condition.     

基于科赫曲线分形结构太赫兹带通滤波器

太赫兹滤波器是太赫兹通信、太赫兹成像和太赫兹检测等太赫兹应用系统中不可或缺的功能器件。按照不同的分类方式,滤波器有不同的种类,常见的按照选频功能可分为高通滤波器、低通滤波器、带阻滤波器和带通滤波器。为了实现在太赫兹波段的滤波效果,世界各地的研究人员利用不同的结构、材料和控制方式实现了功能各异的太赫兹滤波器,但是考虑到设计的器件要应用到太赫兹系统中,成本低廉、结构简单、性能优越的太赫兹滤波器一直是研究人员的追求。分形概念自提出以来在很多研究领域都有了快速发展,但是在太赫兹波段的应用还不是很常见,特别是应用于太赫兹功能器件的设计。引入分形中科赫曲线的概念设计并制备了一种新型的太赫兹带通滤波器,该滤波器是在金属薄膜上刻蚀出科赫曲线分形结构,当太赫兹波垂直入射到该滤波器时候实现了在太赫兹波段的窄带滤波。在滤波器的设计过程中,追求理论与实验相结合,首先在电磁仿真软件中建立科赫曲线分形结构滤波器模型进行计算,探究分形结构应用于太赫兹波段进行滤波的可行性,在进行多次计算之后得到优化后的尺寸和结构,然后根据优化后的尺寸加工出科赫曲线分形结构太赫兹滤波器样品,并且将样品放在太赫兹时域光谱系统中进行实验测量,得到实验数据后与仿真结果进行比较。在仿真中利用了时域有限差分法模拟科赫曲线分形结构太赫兹带通滤波器的传输特性,优化后的仿真结果表明:滤波器的谐振频率为0.715 THz,透射系数能够达到0.92,-3 dB带宽为21.9 GHz,将仿真得到的散射参数进行S参数反演得到了太赫兹滤波器样品的电磁参数,这在理论上分析了太赫兹波在谐振点处产生透射增强的原因。利用飞秒激光微加工系统制备了尺寸优化后的科赫曲线分形结构太赫兹带通滤波器样品,然后使用太赫兹时域光谱系统对样品的传输特性进行测试,对实验得到的时域数据进行快速傅里叶变换之后得到频域数据,再把频域数据进行归一化处理后与之前的电磁仿真结果进行对比,发现实验测得的结果与电磁软件仿真得到的结果较为吻合。     

Equivalence of variational inequality problems to unconstrained minimization

In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.